The Re nement Relation of Graph - BasedGeneric
نویسندگان
چکیده
version 3, Sep. 3, 98 This paper studies a particular variant of Generic Programming, called Adaptive Programming (AP). We explain the approach taken by Adap-tive Programming to attain the goals set for Generic Programming. Within the formalism of AP, we explore the important problem of re-nement: given two generic programs, does one express a subset of the programs expressed by the other? We show that two natural deenitions of reenement coincide, but the corresponding decision problem is com-putationally intractable (co-NP-complete). We proceed to deene a more restricted notion of reenement, which arises frequently in the practice of AP, and give an eecient algorithm for deciding it.
منابع مشابه
Class Re nement and Interface Re nement in Object-Oriented Programs
Constructing new classes from existing ones by inheritance or subclassing is a characteristic feature of object-oriented development. Imposing semantic constraints on subclassing allows us to ensure that the behaviour of superclasses is preserved or re ned in their subclasses. This paper de nes a class re nement relation which captures these semantic constraints. The class re nement relation is...
متن کاملComputing Simulations on Finite and In nite Graphs y
We present algorithms for computing similarity relations of labeled graphs. Similarity relations have applications for the re nement and veri cation of reactive systems. For nite graphs, we present an O(mn) algorithm for computing the similarity relation of a graph with n vertices and m edges (assuming m n). For e ectively presented in nite graphs, we present a symbolic similarity-checking proc...
متن کاملClass Reenement and Interface Reenement I N Object-oriented Development
Constructing new classes from existing ones by inheritance or subclassing is a character istic feature of object oriented development Imposing semantic constraints on subclassing allows us to ensure that behaviour of superclasses is preserved or re ned in their subclasses This paper de nes the class re nement relation which captures these semantic constraints The class re nement relation is bas...
متن کاملAn Extended VDM Refinement Relation
The original de nition of re nement proof obligations in VDM is reviewed and examples are discussed which while being in tuitively sensible pose problems for this de nition of re nement An extended VDM re nement relation is introduced to cope with the prob lems Some non standard applications of the extended re nement proof obligations are discussed
متن کاملTowards a generic editor for subdivision surfaces
Subdivision surfaces are de ned by a mesh of points and by one or more re nement rules according to which new subsets of points are substituted for existing subsets which are usually smaller in size, to yield re ned meshes. The re nement rules de ning a subdivision surface are known collectively as the re nement process de ning the surface. Re nement processes of interest are any for which the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998